Dynamic Interpolation Search Revisited
نویسندگان
چکیده
A new dynamic Interpolation Search (IS) data structure is presented that achieves O(log log n) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such previous result holds for IS when the probability of key collisions is measurable. Moreover, our data structure exhibits O(1) expected search time with high probability for a wide class of input distributions that contains all those for which o(log log n) expected search time was previously known.
منابع مشابه
An Adaptation of a Root Finding Method to Searching Ordered Disk Files Revisited an Extensive Simulation Has Been Carried out on Ibm at with Turbo Pascal
In the present report, Interpolation search, Fast search and Pegasus method are compared with respect to their performance in searching ordered disk files for several key distributions. The aim is to study the effect of the page capacity on searching performance. Cost metric is the number of page accesses and not key comparisons. Numerical results are illustrated and a new approximate formula i...
متن کاملDynamic programming search techniques for across-word modelling in speech recognition
We describe the integration of across-word models in the RWTH large vocabulary continuous speech recognition system, where our main focus is on the realization of the acoustic recognition process. This paper presents a study of two search methods based on the priniciple of dynamic programming. For both methods we discuss the implementation details and give experimental results on the Verbmobil ...
متن کاملA characterization of helical polynomial curves of any degree
We give a full characterization of helical polynomial curves of any degree and a simple way to construct them. Existing results about Hermite interpolation are revisited. A simple method to select the best quintic interpolant among all possible solutions is suggested.
متن کاملUnique Decoding of Plane AG Codes Revisited
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gröbner bases of modules on the coordinate ring of the base curve. With the same decoding performance, the new algorithm has a more conceptual description that lets us better understand the majority voting procedure central in the interpolation-based unique decoding.
متن کاملA File Organization Scheme for Polygon Data
l This paper presents a fIle organization scheme for representing polygon data by a quadtree. The proposed scheme is an adaptive cell method that is based on extendible hashing and interpolation-based index maintenance. It aims, on the average, to locate the record associated with a given key with one disk access (or at most two), maintaining a high storage utilization ratio. It also aims to pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006